An isomorphism theorem for certain finite groups
نویسندگان
چکیده
منابع مشابه
The Even Isomorphism Theorem for Coxeter Groups
Coxeter groups have presentations 〈S : (st)st∀s, t ∈ S〉 where for all s, t ∈ S, mst ∈ {1, 2, . . . ,∞}, mst = mts and mst = 1 if and only if s = t. A fundamental question in the theory of Coxeter groups is: Given two such “Coxeter” presentations, do they present the same group? There are two known ways to change a Coxeter presentation, generally referred to as twisting and simplex exchange. We ...
متن کاملAn isomorphism theorem for digraphs
A seminal result by Lovász states that two digraphs A and B (possibly with loops) are isomorphic if and only if for every digraph X the number of homomorphisms X → A equals the number of homomorphisms X → B. Lovász used this result to deduce certain cancellation properties for the direct product of digraphs. We develop an analogous result for the class of digraphs without loops, and with weak h...
متن کاملAn Isomorphism Theorem for Finitely Additive Measures
A problem which is appealing to the intuition in view of the relative frequency interpretation of probability is to define a measure on a countable space which assigns to each point the measure 0. Such a measure of course becomes trivial if it is countably additive. Finitely additive measures of this type have been discussed by R. C. Buck [l] and by E. F. Buck and R. C. Buck [2]. In a discussio...
متن کاملAn Isomorphism Theorem for Real-Closed Fields
A classical theorem of Steinitz [I& p. 1251 states that the characteristic of an algebraically closed field, together with it.s absolute degree of transcendency, uniquely det,ermine the field (up to isomorphism). It is easily seen that the word real-closed cannot be substituted for the words algebraically closed in this theorem. It is therefore natural to inquire what invariants other than the ...
متن کاملAn Isomorphism Theorem for Partial Numberings
As is well-known, two equivalent total numberings are computably isomorphic, if at least one of them is precomplete. Selivanov asked whether a result of this type is true also for partial numberings. As has been shown by the author, numberings of this kind appear by necessity in studies of effectively given topological spaces like the computable real numbers. In the present paper it is demonstr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Illinois Journal of Mathematics
سال: 1963
ISSN: 0019-2082
DOI: 10.1215/ijm/1255644639